A novel penalty function method for semivectorial bilevel programming problem
نویسندگان
چکیده
منابع مشابه
A Self Adaptive Penalty Function Based Genetic Algorithm for value-Bilevel Programming Problem
This paper propose a self adaptive penalty function for solving constrained value-bilevel programming problem using genetic algorithm. This self adaptive penalty function based genetic algorithm both used in the higher level and the lower level problem's solving process. In the constraint handing method, a new fitness value called distance value, in the normalized fitness-constraint violation s...
متن کاملNew Optimality Conditions for the Semivectorial Bilevel Optimization Problem
The paper is concerned with the optimistic formulation of a bilevel optimization problem with multiobjective lower-level problem. Considering the scalarization approach for the multiobjective program, we transform our problem into a scalar-objective optimization problem with inequality constraints by means of the well-known optimal value reformulation. Completely detailed first-order necessary ...
متن کاملNew Optimality Conditions for the Semivectorial Bilevel Optimization Problem New Optimality Conditions for the Semivectorial Bilevel Optimization Problem Herstellung: Medienzentrum Der Tu Bergakademie Freiberg New Optimality Conditions for the Semivectorial Bilevel Optimization Problem
The paper is concerned with the optimistic formulation of a bilevel optimization problem with multiobjective lower-level problem. Considering the scalarization approach for the multiobjective program, we transform our problem into a scalar-objective optimization problem with inequality constraints by means of the well-known optimal value reformulation. Completely detailed first-order necessary ...
متن کاملA New Method For Solving Linear Bilevel Multi-Objective Multi-Follower Programming Problem
Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...
متن کاملA New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2016
ISSN: 0307-904X
DOI: 10.1016/j.apm.2015.04.041